Non-Computability of Consciousness
نویسندگان
چکیده
منابع مشابه
Non-Computability of Consciousness
With the great success in simulating many intelligent behaviors using computing devices, there has been an ongoing debate whether all conscious activities are computational processes. In this paper, the answer to this question is shown to be no. A certain phenomenon of consciousness is demonstrated to be fully represented as a computational process using a quantum computer. Based on the computa...
متن کاملComputability and Non-computability Issues in Amorphous Computing
Amorphous computing systems consist of a huge set of tiny simple stationary or mobile processors whose computational, communication and sensory part is reduced to an absolute minimum. In an airborne medium the processors communicate via a short-range radio while in a waterborne medium via molecular communication. In some cases the computational part of the processors can be simplified down to f...
متن کاملNon-Turing Computers and Non-Turing Computability*
Various examples of Malament-Hogarth (hereafter, M-H) spacetimes are given in Hogarth (1992), but the following artificial example from Earman and Norton (1993) is perhaps the simplest. Start with Minkowski spacetime (R4, η) and choose a scalar field Ω on M such that Ω=1 outside a compact set C⊂M and Ω tends rapidly to infinity as a point r∈C is approached. The spacetime (R4-r, Ω2η), depicted i...
متن کاملTuring computability of (non-)linear optimization
We consider the classical LINEAR OPTIMIZATION problem, but in the Turing rather than the REAL-RAM model. Asking for mere computability of a function’s maximum over some closed domain, we show that the common presumptions ‘full-dimensional’ and ‘bounded’ in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other...
متن کاملQuasiperiodicity and Non-computability in Tilings
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove the existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the fixed point construction [12]; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: NeuroQuantology
سال: 2007
ISSN: 1303-5150
DOI: 10.14704/nq.2007.5.4.146